Embedding CSP in PVS. An Application to Authentication Protocols
نویسندگان
چکیده
In [28], Schneider applies CSP to the modelling and analysis of authentication protocols and develops a general proof strategy for verifying authentication properties. This paper shows how the PVS theorem prover can provide e ective mechanical support to the approach.
منابع مشابه
Using a PVS Embedding of CSP to Verify Authentication Protocols To be presented at TPHOLs Bell Labs Murray Hill New Jersey USA
This paper presents an application of PVS to the veri cation of security protocols The objective is to provide mechanical support for a veri cation method described in The PVS formalization consists of a semantic embedding of CSP and of a collection of theorems and proof rules for reasoning about authentication properties We present an application to the Needham Schroeder public key protocol
متن کاملUsing a PVS Embedding of CSP to Verify Authentication Protocols
This paper presents an application of PVS to the veri cation of security protocols. The objective is to provide mechanical support for a veri cation method described in [14]. The PVS formalization consists of a semantic embedding of CSP and of a collection of theorems and proof rules for reasoning about authentication properties. We present an application to the Needham-Schroeder public key pro...
متن کاملUsing a PVS Embedding of CSP to
This paper presents an application of PVS to the veriication of security protocols. The objective is to provide mechanical support for a veriication method described in 14]. The PVS formalization consists of a semantic embedding of CSP and of a collection of theorems and proof rules for reasoning about authentication properties. We present an application to the Needham-Schroeder public key prot...
متن کاملAnalysing Time Dependent Security Properties in CSP Using PVS
This paper details an approach to verifying time dependent authen tication properties of security protocols We discuss the introduction of time into the Communicating Sequential Processes CSP protocol veri cation framework of The embedding of CSP in the theorem prover PVS Prototype Veri cation System is extended to incorporate event based time retaining the use of the existing rank function app...
متن کاملA Theorem-Proving Approach to Verification of Fair Non-repudiation Protocols
We use a PVS embedding of the stable failures model of CSP to verify non-repudiation protocols, allowing us to prove the correctness of properties that are difficult to analyze in full generality with a model checker. The PVS formalization comprises a semantic embedding of CSP and a collection of theorems and proof rules for reasoning about non-repudiation properties. The well-known Zhou-Gollma...
متن کامل